On one-one polynomial time equivalence relations
نویسندگان
چکیده
منابع مشابه
On One-One Polynomial Time Equivalence Relations
Two sets A and B are one-one polynomial time equivalent (one-one p-equivalent) if there are polynomial time one-one reductions from A to B and from B to A. In this paper we show that all EXPTIME complete sets are one-one p-equivalent by length increasing reductions. Moreover we show this result for many complexity classes which can be proved by a straightforward diagonalization to contain P pro...
متن کاملOne-one Polynomial Maps
It is a fundamental fact about simultaneous linear equations that uniqueness implies existence in the sense that if the »X» system MX= Y has, for each Y, at most one solution X, then, for each Y, the equation actually has a solution. Our purpose is to show that this situation persists for certain "nonlinear equations" as well, namely that, restricting everything to the reals, if Pi, P2 are poly...
متن کاملA Polynomial Time Algorithm to Determine Maximal Balanced Equivalence Relations
Following Golubitsky, Stewart, and others, we give definitions of networks and input trees. In order to make our work as general as possible, we work with a somewhat extended notion of multiplicity, and introduce the concept of “bunching” of trees. We then define balanced equivalence relations on networks, and a partial ordering on these relations. Previous work has shown that there is a maxima...
متن کاملOn ~-reducibility versus Polynomial Time Many-one Reducibility*
We prove that each element of a class of f,anctions (denoted by NPCtP), whose graphs can be accepted in nondeterministic polynomial time, can be evaluated in deterministic polynomial time if and only if '/-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every ,/-reduc...
متن کاملEquivalence Relations Polynomial Interpolation Public Key Crypotography
We present an environment for learning and teaching mathematics that aims at inspiring the creative potential of students by enabling the learners to perform various kinds of interactive experiments during their learning process. Computer interactions are both of visual and purely formal mathematical nature, where the computer-algebra system Mathematica powers the visualization of mathematical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90218-x